home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.c
- Path: cdf.toronto.edu!news
- From: Luben Tuikov <a228tuik>
- Subject: Bit Tables in Virtual Hashing.. Anyone?
- Content-Type: text/plain; charset=us-ascii
- Message-ID: <DpA2Ew.Arw@cdf.toronto.edu>
- Sender: news@cdf.toronto.edu (Usenet News)
- Nntp-Posting-Host: killozap
- Content-Transfer-Encoding: 7bit
- Organization: Computing Disciplines Facility, University of Toronto
- Mime-Version: 1.0
- Date: Wed, 3 Apr 1996 08:32:55 GMT
- X-Mailer: Mozilla 1.1N (X11; I; SunOS 5.3 sun4c)
- X-Url: news:comp.lang.c
-
- Hi,
- I have a problem understanding the use of BIT TABLES in VIRTUAL
- HASHING. An attempt to use a bucket header to store the number
- of records and the mod factor for a particular bucket (if it has
- been split <=> overflow) failed when mod factor for a primary
- bucket (key mod N (N:# of buckets)) became bigger than the
- sub-path buckets' mod factors (???) ...
-
- Anyway... My reference is:
- W. Litwin, "Virtual hashing: a dynamically changing hashing",
- Proceedings of the Fourth International Conference on Very Large
- Databases, pp. 517-523, West Berlin, September 13-15, 1978.
-
- Can anyone clear this matter for me, since the pseudo code in
- my reference is somewhat too high-level for me?
-
- I'd appreciate your help.
-
- Luben
- a228tuik@cdf.toronto.edu
-
- P.S. I am a C programmer - if that'll ease up your answer.
- Thanks in advance.
-
-